Under consideration for publication in Theory and Practice of Logic Programming 1 Lightweight compilation of (C)LP to JavaScript ∗ Jose F. Morales1 , Rémy Haemmerlé2 ,

Source URL: clip.dia.fi.upm.es

facultad de inform´ atica universidad polit´ecnica de madrid Automatic Coding Rule Conformance Checking Using Logic Programming

Source URL: clip.dia.fi.upm.es

• C programming language
• MISRA C
• Prolog
• C
• Type system
• Computing
• Programming language theory
• Software engineering

Embedding logics in Dedukti 2014 edition Ali Assaf 2nd KWARC-Deducteam workshop May 26, 2014

Source URL: who.rocq.inria.fr

• Type theory
• Lambda calculus
• Formal methods
• Logic in computer science
• Coq
• Pure type system
• HOL
• Correctness
• Automated proof checking
• Theoretical computer science
• Applied mathematics
• Programming language theory

TEX in Teaching Michael Moortgat, Richard Moot, Dick Oehrle Contents

Source URL: www.ntg.nl

• Programming language theory
• Compiler construction
• Prolog
• Computational linguistics
• Logic
• Parsing
• Formal sciences
• Software engineering
• Science

JFP 19 (6): 699–722, c Cambridge University Press 2009  699

Source URL: www.kurims.kyoto-u.ac.jp

• Logic in computer science
• Programming language semantics
• Models of computation
• Denotational semantics
• Operational semantics
• Structure
• Lambda calculus
• Theoretical computer science
• Mathematics
• Mathematical logic

Balancing lists: a proof pearl? Guyslain Naves1 and Arnaud Spiwack2 1 Aix Marseille Université, CNRS, LIF UMR 7279, 13288, Marseille, France

Source URL: assert-false.net

• Recursion
• Higher-order functions
• Functional languages
• Mathematical logic
• Computability theory
• Binary tree
• Map
• Tree
• Binary search tree
• Computer programming
• Computing
• Software engineering

Semantic Acyclicity on Graph Databases Pablo Barceló Miguel Romero Moshe Vardi

Source URL: users.dcc.uchile.cl

• Database theory
• Decomposition method
• Theoretical computer science
• Directed graph
• Structure
• Mathematical logic
• Constraint programming
• Mathematics
• Conjunctive query

Language Engineering as an Enabler for Incrementally Defined Formal Analyses Daniel Ratiu∗ , Markus Voelter† , Bernhard Schaetz∗ , Bernd Kolb‡ ∗ ForTISS, Munich, Germany, {ratiu | schaetz}@fortiss.org † indep

Source URL: mbeddr.com

• Theoretical computer science
• Model checkers
• Logic in computer science
• NuSMV
• Model checking
• Formal verification
• Domain-specific language
• Programming language
• Feature model
• Formal methods
• Software
• Mathematics

The Ciao Approach to the Dynamic vs. Static Language Dilemma (Position/System/Demo Paper1 ) M. V. Hermenegildo1,2 F. Bueno1 M. Carro1 P. L´opez-Garc´ıa2,4 E. Mera3 J. F. Morales2 G. Puebla1 1

Source URL: clip.dia.fi.upm.es

• Programming paradigms
• Type theory
• Functional languages
• Logic in computer science
• Ciao
• Assertion
• Constraint programming
• Type system
• Programming language
• Software engineering
• Computing
• Computer programming

Answer Set Programming Answer Set Programs Answer Set Semantics Implementation Techniques Using Answer Set Programming

Source URL: www.cs.bath.ac.uk

• Computing
• Answer set programming
• Stable model semantics
• Prolog
• DLV
• Constraint satisfaction
• Logic programming
• Software engineering
• Computer programming